A bimodal perspective on possibility semantics

نویسندگان

  • Johan van Benthem
  • Nick Bezhanishvili
  • Wesley H. Holliday
چکیده

In this paper we develop a bimodal perspective on possibility semantics, a framework allowing partiality of states that provides an alternative modeling for classical propositional and modal logics [Humberstone, 1981, Holliday, 2015a]. In particular, we define a full and faithful translation of the basic modal logic K over possibility models into a bimodal logic of partial functions over partial orders, and we show how to modulate this analysis by varying across logics and model classes that have independent topological motivations. This relates the two realms under comparison both semantically and syntactically at the level of derivations. Moreover, our analysis clarifies the interplay between the complexity of translations and axiomatizations of the corresponding logics: adding axioms to the target bimodal logic simplifies translations, or vice versa, complex translations can simplify frame conditions. We also investigate a transfer of first-order correspondence theory between possibility semantics and its bimodal counterpart. Finally, we discuss the conceptual trade-off between giving translations and giving new semantics for logical systems, and we identify a number of further research directions to which our analysis gives rise.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A duality between LM-fuzzy possibility computations and their logical semantics

Let X be a dcpo and let L be a complete lattice. The family σL(X) of all Scott continuous mappings from X to L is a complete lattice under pointwise order, we call it the L-fuzzy Scott structure on X. Let E be a dcpo. A mapping g : σL(E) −> M is called an LM-fuzzy possibility valuation of E if it preserves arbitrary unions. Denote by πLM(E) the set of all LM-fuzzy possibility valuations of E. T...

متن کامل

A generalization of the Chen-Wu duality into quantale-valued setting

With the unit interval [0,1] as the truth value table, Chen and Wupresented the concept of  possibility computation over dcpos.Indeed, every possibility computation can be considered as a[0,1]-valued Scott open set on a dcpo. The aim of this paper is tostudy Chen-Wu's duality on quantale-valued setting. For clarity,with a commutative unital quantale $L$ as the truth value table, weintroduce a c...

متن کامل

Translation and Hybridity in Scenes and Frames Semantics

 The present study is a theoretical attempt to illustrate how Fillmore's Scenes and Frames Semantics (SFS) could be employed as a framework to portray the process of understanding and translating hybrid texts. It first reviews the origin of SFS; then it maps SFS onto Nida’s linguistic model of translation process and the Interpretive Theory of Translation; it examines in the next section, withi...

متن کامل

Algorithmic Correspondence, Canonicity and Completeness for Possibility Semantics

Possibility semantics. Possibility semantics for modal logic is a generalization of standard Kripke semantics. In this semantics, a possibility frame has a refinement relation which is a partial order between states, in addition to the accessibility relation for modalities. From an algebraic perspective, full possibility frames are dually equivalent to complete Boolean algebras with complete op...

متن کامل

The Possibility of Go`s Being Seen« as Viewed by Ayatollah Ma`refat in His Commentary with an Emphasis on Semiotic Approach

The issue of the possibility of God`s being seen at the resurrection is disputed by the scholars of Imamiyyah, Mu'tazilites and Ash'arites. This is due to differences found in the acceptance of the different semantic aspects of the "God`s being seen". Ayatollah Ma'refat has discussed this issue in his al-Tafsir al-Athari al-Jama'i and al-Ta'mhid and, having analyzed the text and the documentati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Log. Comput.

دوره 27  شماره 

صفحات  -

تاریخ انتشار 2017